Problem:
 f(f(X)) -> c(f(g(f(X))))
 c(X) -> d(X)
 h(X) -> c(d(X))

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {5,4,3}
   transitions:
    c1(20) -> 21*
    c1(14) -> 15*
    d1(12) -> 13*
    d1(6) -> 7*
    d2(22) -> 23*
    d2(28) -> 29*
    f0(2) -> 3*
    f0(1) -> 3*
    c0(2) -> 4*
    c0(1) -> 4*
    g0(2) -> 1*
    g0(1) -> 1*
    d0(2) -> 2*
    d0(1) -> 2*
    h0(2) -> 5*
    h0(1) -> 5*
    1 -> 6*
    2 -> 12*
    7 -> 14,4
    13 -> 20,4
    14 -> 22*
    15 -> 5*
    20 -> 28*
    21 -> 5*
    23 -> 15*
    29 -> 21,5
  problem:
   
  Qed